-
1 depth of vertex
Большой англо-русский и русско-английский словарь > depth of vertex
-
2 depth of vertex
Математика: глубина вершины (графа) -
3 depth of vertex
-
4 vertex
-
5 depth
1) глубина || глубинный2) высота3) толщина; мощность ( пласта)4) насыщенность ( цвета)•in depth — по тощине, вглубь
-
6 глубина вершины
Большой англо-русский и русско-английский словарь > глубина вершины
-
7 height
1. n высота, вышина2. n ростwhat is her height? — какого она роста?; какой у неё рост?
3. n высота над уровнем моря4. n тех. высотная отметка5. n астр. высота над горизонтом6. n вершина, верх, верхушка7. n часто холм, возвышенность, высота8. n верх, высшая степень; апогей; разгар9. n библ. небеса10. n арх. знатность11. n арх. возвышенность натуры12. n арх. тех. подъём стрелыСинонимический ряд:1. elevation (noun) altitude; elevation; eminence; highness; loftiness; size; stature; tallness2. extreme (noun) extreme; limit; utmost3. peak (noun) acme; apex; apogee; climax; crest; crown; culmination; meridian; peak; pinnacle; summit; top; vertex; zenith4. rise (noun) alp; hill; mountain; prominence; rise; slopeАнтонимический ряд:depth; nadir
См. также в других словарях:
Depth-first search — Order in which the nodes are visited Class Search algorithm Data structure Graph Worst case performance … Wikipedia
Depth-limited search — Class Search Algorithm Data structure Graph Worst case performance O( | V | + | E | ) … Wikipedia
Cut vertex — In mathematics and computer science, a cut vertex or articulation point is a vertex of a graph such that removal of the vertex causes an increase in the number of connected components. If the graph was connected before the removal of the vertex,… … Wikipedia
OpenGL — Original author(s) Silicon Graphics Developer(s) Khronos Group Stable release 4.2 … Wikipedia
Biconnected component — Each color corresponds to a biconnected component. Multi colored vertices are cut vertices, and thus belong to multiple biconnected components. In graph theory, a biconnected component (or 2 connected component) is a maximal biconnected subgraph … Wikipedia
Direct3D — is part of Microsoft s DirectX API. Direct3D is only available for Microsoft s various Windows operating systems (Windows 95 and above) and is the base for the graphics API on the Xbox and Xbox 360 console systems. Direct3D is used to render… … Wikipedia
Microsoft Direct3D — Direct3D is part of Microsoft s DirectX application programming interface (API). Direct3D is available for Microsoft Windows operating systems (Windows 95 and above), and for other platforms through the open source software Wine. It is the base… … Wikipedia
2-satisfiability — In computer science, 2 satisfiability (abbreviated as 2 SAT or just 2SAT) is the problem of determining whether a collection of two valued (Boolean or binary) variables with constraints on pairs of variables can be assigned values satisfying all… … Wikipedia
Dijkstra's algorithm — Not to be confused with Dykstra s projection algorithm. Dijkstra s algorithm Dijkstra s algorithm runtime Class Search algorithm Data structure Graph Worst case performance … Wikipedia
Binary tree — Not to be confused with B tree. A simple binary tree of size 9 and height 3, with a root node whose value is 2. The above tree is unbalanced and not sorted. In computer science, a binary tree is a tree data structure in which each node has at… … Wikipedia
Prim's algorithm — Graph and tree search algorithms Alpha beta pruning A* B* Beam Bellman–Ford algorithm Best first Bidirectional … Wikipedia
